Learning to Rank for Educational Search Engines

نویسندگان

چکیده

In this digital age, there is an abundance of online educational materials in public and proprietary platforms. To allow effective retrieval resources, it a necessity to build keyword-based search engines over these collections. modern Web engines, high-quality rankings are obtained by applying machine learning techniques, known as rank (LTR). article, our focus on constructing machine-learned ranking models be employed engine the education domain. Our contributions threefold. First, we identify analyze rich set features (including click-based domain-specific ones) search. LTR trained outperform various baselines based ad-hoc functions two neural models. As second contribution, utilize domain knowledge query-dependent specialized for certain courses or levels. experiments reveal that both general model other baselines. Finally, given well-known importance user clicks LTR, third contribution handling singleton queries without any click information. end, propose new strategy “propagate” information from other, similar, queries. The proposed propagation approach yields better performance than another baseline literature. Overall, findings models, using approaches, yield high effectiveness search, which may ultimately lead experience.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FPGA-based Accelerators for “Learning to Rank” in Web Search Engines

Search relevance is a key measurement to judge the usefulness of search engines, which may change a search company’s market cap by tens of billions of dollars. With the ever-increasing scale of the World Wide Web, machine learning technologies have become important tools to improve search relevance rankings. However, these machine learning algorithms are slow on large datasets using general pur...

متن کامل

Learning to Rank for Semantic Search

PageRank, one of the most important algorithms in information retrieval, was developed to give an estimate of how many users are likely to be visiting a given page on the web at a given moment. This way PageRank gives an approximation of the popularity of a page. Because semantic web resources can be represented in a RDF graph it is easy to adapt the original PageRank algorithm to rank these re...

متن کامل

A semantic association page rank algorithm for web search engines

The majority of Semantic Web search engines retrieve information by focusing on the use of concepts and relations restricted to the query provided by the user. By trying to guess the implicit meaning between these concepts and relations, probabilities are calculated to give the pages a score for ranking. In this study, I propose a relation-based page rank algorithm to be used as a Semantic Web ...

متن کامل

Long-Term Learning for Web Search Engines

This paper considers how web search engines can learn from the successful searches recorded in their user logs. Document Transformation is a feasible approach that uses these logs to improve document representations. Existing test collections do not allow an adequate investigation of Document Transformation, but we show how a rigorous evaluation of this method can be carried out using the refer...

متن کامل

Effective Learning to Rank Persian Web Content

Persian language is one of the most widely used languages in the Web environment. Hence, the Persian Web includes invaluable information that is required to be retrieved effectively. Similar to other languages, ranking algorithms for the Persian Web content, deal with different challenges, such as applicability issues in real-world situations as well as the lack of user modeling. CF-Rank, as a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Learning Technologies

سال: 2021

ISSN: ['2372-0050', '1939-1382']

DOI: https://doi.org/10.1109/tlt.2021.3075196